Indivisibility and Divisibility Polytopes
نویسنده
چکیده
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p | the indivisibility polytopes, as well as the more general \clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
منابع مشابه
Core Discussion Paper 2000/xx Indivisibility and Divisibility Polytopes
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p | the indivisibility polytopes, as well as the more general \clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
متن کاملIndivisibility of Class Numbers of Imaginary Quadratic Fields and Orders of Tate-shafarevich Groups of Elliptic Curves with Complex Multiplication
Since Gauss, ideal class groups of imaginary quadratic fields have been the focus of many investigations, and recently there have been many investigations regarding TateShafarevich groups of elliptic curves. In both cases the literature is quite extensive, but little is known. Throughout D will denote a fundamental discriminant of a quadratic field. Let CL(D) denote the class group of Q( √ D), ...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملON MODALITY AND DIVISIBILITY OF POISSON AND BINOMIAL MIXTURES
Some structural aspects of mixtures, in general, have been previously investigated by the author in [I] and [2]. The aim of this article is to investigate some important structural properties of the special cases of Poisson and binomial mixtures in detail. Some necessary and sufficient conditions are arrived at for different modality and divisibility properties of a Poisson mixture based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000